A Conservative Look at Operational Semantics with Variable Binding
نویسندگان
چکیده
We set up a formal framework to describe transition system specifications in the style of Plotkin. This framework has the power to express many-sortedness, general binding mechanisms and substitutions, among other notions such as negative hypotheses and unary predicates on terms. The framework is used to present a conservativity format in operational semantics, which states sufficient criteria to ensure that the extension of a transition system specification with new transition rules does not affect the semantics of the original terms.
منابع مشابه
Variable binding operators in transition system specifications
In this paper the approach to structural operational semantics (SOS) using transition system specifications (TSSs) is extended to deal with variable binding operators and many-sortedness. Bisimulation and Verhoef’s transition rule format, known as the panth format, generalize naturally to the new TSSs. It is shown that in this setting bisimulation is still a congruence for meaningful TSSs in pa...
متن کاملA Logic Programming Language Based on Binding Algebras
We give a logic programming language based on Fiore, Plotkin and Turi’s binding algebras. In this language, we can use not only first-order terms but also terms involving variable binding. The aim of this language is similar to Nadathur and Miller’s λProlog, which can also deal with binding structure by introducing λ-terms in higher-order logic. But the notion of binding used here is finer in a...
متن کاملConservative Extension in Positive /
We transpose a conservative extension theorem from structural operational semantics to conditional term rewriting. The result is useful for the development of software renovation factories, and for modular speciication of abstract data types.
متن کاملConservative Extension in Positive/Negative Conditional Term Rewriting with Applications to Software Renovation Factories
We transpose a conservative extension theorem from structured operational semantics to conditional term rewriting. The result is useful for the development of software renovation factories, and for modular speci cation of abstract data types.
متن کاملOn Name Generation and Set-Based Analysis in the Dolev-Yao Model
We study the control reachability problem in the Dolev-Yao model of cryptographic protocols when principals are represented by tail recursive processes with generated names. We propose a conservative approximation of the problem by reduction to a non-standard collapsed operational semantics and we introduce checkable syntactic conditions entailing the equivalence of the standard and the collaps...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Comput.
دوره 146 شماره
صفحات -
تاریخ انتشار 1998